Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
نویسندگان
چکیده
منابع مشابه
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
The arboricity of a hypergraph H is the minimum number of acyclic hypergraphs that partition H . The determination of the arboricity of hypergraphs is a problem motivated by database theory. The exact arboricity of the complete k-uniform hypergraph of order n is previously known only for k ∈ {1, 2, n − 2, n − 1, n}. The arboricity of the complete k-uniform hypergraph of order n is determined as...
متن کاملNew type of coding problem motivated by database theory
The present paper is intended to survey the interaction between Relational Database Theory and Coding Theory. In particular it is shown how an extremal problem for relational databases gives rise to a new type of coding problem. The former concerns minimal representation of branching dependencies that can be considered as a data mining type question. The extremal configurations involve d-distan...
متن کاملOn complexity of the acyclic hypergraph sandwich problem a
Given two hypergraphs H and H ′ on a common vertex set, we write H < H ′ if each edge of H is contained in an edge of H ′. Given H < H ′, either find an acyclic hypergraph A between them, H < A < H ′, or claim that there is no such A. This problem is referred to as the Acyclic Hypergraph Sandwich Problem (AHSP) (H,H ′). We show that one can assume without loss of generality that H is a graph. T...
متن کاملHypergraph Covering Problems Motivated by Genome Assembly Questions
The Consecutive-Ones Property (C1P) is a classical concept in discrete mathematics that has been used in several genomics applications, from physical mapping of contemporary genomes to the assembly of ancient genomes. A common issue in genome assembly concerns repeats, genomic sequences that appear in several locations of a genome. Handling repeats leads to a variant of the C1P, the C1P with mu...
متن کاملThe α-Arboricity of Complete Uniform Hypergraphs
α-acyclicity is an important notion in database theory. The α-arboricity of a hypergraphH is the minimum number of α-acyclic hypergraphs that partition the edge set of H. The α-arboricity of the complete 3-uniform hypergraph is determined completely.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.024